Spatial and Temporal Communities-based Routing Algorithm in Human Social Network

نویسندگان

  • Tao ZHOU
  • Hongbing XU
  • Yuanyuan CHEN
چکیده

Human Contact Network is a kind of DTN (Delay Tolerant Networks), and is closely related with people’ activities. Owing to its intermittent connectivity and unique human mobility patterns, how to transmit data in an effective way is a challenging problem for DTN. In this paper, considering the regularity of people activities, we introduce a THM (Trip History Model) to record the activities of people. Through the spatial and temporal characteristic of people stored in THM, combined the community theory, the further moving destination can be predicted. In order to transfer data more reasonable, Spatial and Temporal Communities-based Routing Algorithm (STCRA) has been proposed, which data will be transferred to superiority nodes through the community history information. A message management mechanism is proposed to effectively control the number of messages and reduce the network overhead. Our simulation results show that, compared with Flooding and LABEL algorithms, STCRA effectively improves the routing performance of the network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STCS-GAF: Spatio-Temporal Compressive Sensing in Wireless Sensor Networks- A GAF-Based Approach

Routing and data aggregation are two important techniques for reducing communication cost of wireless sensor networks (WSNs). To minimize communication cost, routing methods can be merged with data aggregation techniques. Compressive sensing (CS) is one of the effective techniques for aggregating network data, which can reduce the cost of communication by reducing the amount of routed data to t...

متن کامل

Solving the ridesharing problem with Non-homogeneous vehicles by using an improved genetic algorithm and the social preferences of the users

Most existing ridesharing systems perform travel planning based only on two criteria of spatial and temporal similarity of travelers. In general, neglecting the social preferences caused to reduce users' willingness to use ridesharing services. To achieve this purpose a system should be designed and implemented not just based on two necessary conditions of spatial and temporal similarities, but...

متن کامل

Non-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC

For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...

متن کامل

Non-Blocking Routers Design Based on West First Routing Algorithm & MZI Switches for Photonic NoC

For the first time, the 4- and 5-port optical routers are designed by using the West First routing algorithm for use in optical network on chip. The use of the WF algorithm has made the designed routers to provide non-blocking routing in photonic network on chip. These routers not only are based on high speed Mach-Zehnder switches(Which have a higher bandwidth and more thermal tolerance than mi...

متن کامل

Modeling and Spatio-Temporal Analysis of the Distribution of O3 in Tehran City Based on Neural Network and Spatial Analysis in GIS Environment

Air pollution is one of the most problems that people are facing today in metropolitan areas. Suspended particulates, carbon monoxide, sulfur dioxide, ozone and nitrogen dioxide are the five major pollutants of air that pose many problems to human health. The goal of this study is to propose a spatial approach for estimation and analyzing the spatial and temporal distribution of ozone based on ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012